Split Number in Nungon

The total chromatic number of split-indifference graphs

Strong non split r-domination number of a graph

In this paper, we define the notions of inverse strong non-split r-dominating set and inverse strong non-split r-domination number γ′snsr(G) of a graph G. We characterize graphs for which γsnsr(G) + γ′snsr(G) = n, where γsnsr(G) is the strong non-split r-domination number of G. We get many bounds on γ′snsr(G). Nordhaus-Gaddum type results are also obtained for this new parameter.

Edge 2-rainbow domination number and annihilation number in trees

A edge 2-rainbow dominating function (E2RDF) of a graph G is a ‎function f from the edge set E(G) to the set of all subsets‎ ‎of the set {1,2} such that for any edge.......................

The Smallest Prime That Does Not Split Completely in a Number Field

We study the problem of bounding the least prime that does not split completely in a number field. This is a generalization of the classic problem of bounding the least quadratic non-residue. Here, we present two distinct approaches to this problem. The first is by studying the behavior of the Dedekind zeta function of the number field near 1, and the second by relating the problem to questions...

Split support and split conflict randomization tests in phylogenetic inference.

Randomization tests allow the formulation and statistical testing of null hypotheses about the quality of entire data sets or the quality of fit between the data and particular phylogenetic hypotheses. Randomization tests of phylogenetic hypotheses based on the concepts of split support and split conflict are described here, as are tests where splits, rather than the data, are randomly permuted...